Some long rate one-half binary convolutional codes with an optimum distance profile (Corresp.)

Robustly optimal rate one-half binary convolutional codes (Corresp.)

Constructing strongly-MDS convolutional codes with maximum distance profile

This paper revisits strongly-MDS convolutional codes with maximum distance profile (MDP). These are (non-binary) convolutional codes that have an optimum sequence of column distances and attains the generalized Singleton bound at the earliest possible time frame. These properties make these convolutional codes applicable over the erasure channel, since they are able to correct a large number of...

Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)

-A search procedure is developed to find good short binary (N,N 1) convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distance dfrce either cannot achieve the maximum value or is equal to dfree of some code in the remaining set. Further, the search among the remaining codes is started in a subset in which we expect the possibilit...

On (n, n-1) convolutional codes with low trellis complexity

We show that the state complexity profile of a convolutional code is the same as that of the reciprocal of the dual code of in case that minimal encoders for both codes are used. Then, we propose an optimum permutation for any given ( 1) binary convolutional code that will yield an equivalent code with the lowest state complexity. With this permutation, we are able to find many ( 1) binary conv...

New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile